Disjoint homometric sets in graphs
نویسندگان
چکیده
منابع مشابه
On homometric sets in graphs
For a vertex set S ⊆ V (G) in a graph G, the distance multiset, D(S), is the multiset of pairwise distances between vertices of S in G. Two vertex sets are called homometric if their distance multisets are identical. For a graph G, the largest integer h, such that there are two disjoint homometric sets of order h in G, is denoted by h(G). We slightly improve the general bound on this parameter ...
متن کاملHomometric Point Sets and Inverse Problems
The inverse problem of diffraction theory in essence amounts to the reconstruction of the atomic positions of a solid from its diffraction image. From a mathematical perspective, this is a notoriously difficult problem, even in the idealised situation of perfect diffraction from an infinite structure. Here, the problem is analysed via the autocorrelation measure of the underlying point set, whe...
متن کاملHomometric model sets and window covariograms
Two Delone sets are called homometric when they share the same autocorrelation or Patterson measure. A model set Λ within a given cut and project scheme is a Delone set that is defined through a window W in internal space. The autocorrelation measure of Λ is a pure point measure whose coefficients can be calculated via the so-called covariogram of W . Two windows with the same covariogram thus ...
متن کاملA Note on Disjoint Dominating Sets in Graphs
The disjoint domination number γγ(G) of a graph G is the minimum cardinality of the union of two disjoint dominating sets in G. The disjoint independent domination number of a graph G is the minimum cardinality of the union of two disjoint independent dominating sets in G. In this paper we study these two parameters. We determine the value of γγ(G) for several graphs and give partial answers to...
متن کاملDisjoint cliques and disjoint maximal independent sets of vertices in graphs
In this paper, we find lower bounds for the maximum and minimum numbers of cliques in maximal sets of pairwise disjoint cliques in a graph . By complementation, these yield lower bounds for the maximum and minimum numbers of independent sets in maximal sets of pairwise disjoint maximal independent sets of vertices in a graph . In the latter context, we show by examples that one of our bounds is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2010
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.174.027